On unicyclic graphs whose second largest eigenvalue dose not exceed 1

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On unicyclic graphs whose second largest eigenvalue dose not exceed 1

Connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs. In this paper, all unicyclic graphs whose second largest eigenvalue does not exceed 1 have been determined. ? 2003 Elsevier B.V. All rights reserved.

متن کامل

The least eigenvalue of graphs whose complements are unicyclic

A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size n 2 ). In this paper we discuss the ...

متن کامل

Graphs with small second largest Laplacian eigenvalue

Let L(G) be the Laplacian matrix of G. In this paper, we characterize all of the connected graphs with second largest Laplacian eigenvalue no more than l; where l . = 3.2470 is the largest root of the equation μ3 − 5μ2 + 6μ − 1 = 0. Moreover, this result is used to characterize all connected graphs with second largest Laplacian eigenvalue no more than three. © 2013 Elsevier Ltd. All rights rese...

متن کامل

Spectral Characterization of Graphs with Small Second Largest Laplacian Eigenvalue

The family G of connected graphs with second largest Laplacian eigenvalue at most θ, where θ = 3.2470 is the largest root of the equation μ−5μ+6μ−1 = 0, is characterized by Wu, Yu and Shu [Y.R. Wu, G.L. Yu and J.L. Shu, Graphs with small second largest Laplacian eigenvalue, European J. Combin. 36 (2014) 190–197]. Let G(a, b, c, d) be a graph with order n = 2a + b + 2c + 3d + 1 that consists of ...

متن کامل

Ela a Note on Graphs Whose Largest Eigenvalue of the Modularity Matrix Equals Zero

Informally, a community within a graph is a subgraph whose vertices are more connected to one another than to the vertices outside the community. One of the most popular community detection methods is the Newman’s spectral modularity maximization algorithm, which divides a graph into two communities based on the signs of the principal eigenvector of its modularity matrix in the case that the mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2004

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(03)00203-8